The Sidon Constant for Homogeneous Polynomials
نویسنده
چکیده
The Sidon constant for the index set of nonzero m-homogeneous polynomials P in n complex variables is the supremum of the ratio between the l norm of the coefficients of P and the H(D) norm of P . We present an estimate which gives the right order of magnitude for this constant, modulo a factor depending exponentially on m. We use this result to show that the Bohr radius for the polydisc D is bounded from below by a constant times √ (log n)/n.
منابع مشابه
The Bohnenblust-Hille inequality for homogeneous polynomials is hypercontractive
The Bohnenblust–Hille inequality says that the l 2m m+1 -norm of the coefficients of an m-homogeneous polynomial P on C is bounded by ‖P‖∞ times a constant independent of n, where ‖ · ‖∞ denotes the supremum norm on the polydisc D. The main result of this paper is that this inequality is hypercontractive, i.e., the constant can be taken to be C for some C > 1. Combining this improved version of...
متن کاملArithmetic Characterizations of Sidon Sets
Let G be any discrete Abelian group. We give several arithmetic characterizations of Sidon sets in G. In particular, we show that a set A is a Sidon set iff there is a number 6 > 0 such that any finite subset A of A contains a subset B Q A with |B| > 6\A\ which is quasiindependent, i.e. such that the only relation of the form ]C\eB e x ^ = '̂ with e\ equal to + 1 or 0, is the trivial one. Let G ...
متن کاملResults on Sidon and B h Sequences
Results on Sidon and Bh Sequences Sangjune Lee A set A of non-negative integers is a Sidon set if all the sums a1 + a2, with a1 ≤ a2 and a1, a2 ∈ A, are distinct. In this dissertation, we deal with results on the number of Sidon sets in [n] = {0, 1, · · · , n − 1} and the maximum size of Sidon sets in sparse random subsets of [n] or N (the set of natural numbers). We also consider a natural gen...
متن کاملTropical Complexity, Sidon Sets, and Dynamic Programming
Many dynamic programming algorithms for discrete 0-1 optimization problems are just special (recursively constructed) tropical (min,+) or (max,+) circuits. A problem is homogeneous if all its feasible solutions have the same number of 1s. Jerrum and Snir [JACM 29 (1982), pp. 874– 897] proved that tropical circuit complexity of homogeneous problems coincides with the monotone arithmetic circuit ...
متن کاملThe Numerical Solution of Some Optimal Control Systems with Constant and Pantograph Delays via Bernstein Polynomials
In this paper, we present a numerical method based on Bernstein polynomials to solve optimal control systems with constant and pantograph delays. Constant or pantograph delays may appear in state-control or both. We derive delay operational matrix and pantograph operational matrix for Bernstein polynomials then, these are utilized to reduce the solution of optimal control with constant...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2009